Asymptotic Modularity of Some Graph Classes
نویسندگان
چکیده
Modularity has been introduced as a quality measure for graph partitioning. It has received considerable attention in several disciplines, especially complex systems. In order to better understand this measure from a graph theoretical point of view, we study the modularity of a variety of graph classes. We first consider simple graph classes such as tori and hypercubes. We show that these regular graph families have asymptotic modularity 1 (that is the maximum possible). We extend this result to the general class of unit ball graphs of bounded growth metrics. Our most striking result concerns trees with bounded degree which also appear to have asymptotic modularity 1. This last result can be extended to graphs with constant average degree and to some power-law graphs.
منابع مشابه
The Merrifield-Simmons indices and Hosoya indices of some classes of cartesian graph product
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کامل$G$-asymptotic contractions in metric spaces with a graph and fixed point results
In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...
متن کامل4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کامل